Using Nondeterminism to Design Efficient Deterministic Algorithms1
نویسندگان
چکیده
In this paper we illustrate how nondeterminism can be used conveniently and effectively in designing efficient deterministic algorithms. In particular, our method gives a parameterized algorithm of running time O((5.7k)kn) for the 3-D matching problem, which significantly improves the previous algorithm by Downey et al. The algorithm can be generalized to yield an improved algorithm for the r -D matching problem for any positive integer r . The method can also be employed in designing deterministic algorithms for other optimization problems as well.
منابع مشابه
On Limited versus Polynomial Nondeterminism
In this paper, we show that efficient algorithms for some problems Abstract-1 that require limited nondeterminism imply the subexponential simulation of nondeterministic computation by deterministic computation. In particular, if cliques of size O(logn) can be found in polynomial time, then nondeterministic time f(n) is contained in deterministic time 2O( √ f(n) polylog f(n)).
متن کاملRelational Algebraic Semantics of Deterministic and Nondeterministic Programs
Abstract relational algebra is proposed as a practical means to describe the denotational semantics of programming languages. We apply this method of semantics description to a functional language and demonstrate the usefulness of this approach by some examples. In particular, we prove the correctness of a program transformation rule within our calculus. Then, the deterministic language DFP is ...
متن کاملHow Deterministic are Good-For-Games Automata?
In good for games (GFG) automata, it is possible to resolve nondeterminism in a way that only depends on the past and still accepts all the words in the language. The motivation for GFG automata comes from their adequacy for games and synthesis, wherein general nondeterminism is inappropriate. We continue the ongoing effort of studying the power of nondeterminism in GFG automata. Initial indica...
متن کاملIntroduction to Nondeterminism
The term of nondeterminism discussed in this paper is usually not included in the introductory programming courses. Secondary school students are familiar with the idea that programs have to be deterministic because they are processed by computers automatically. Later, when they come to the university, it is difficult for them to understand the concept of nondeterminism. In our opinion, the gen...
متن کاملCombinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines
We introduce new techniques for proving quadratic lower bounds for deterministic and nondeterministic 1-tape Turing machines (all considered Turing machines have an additional one-way input tape). In particular, we derive for the simulation of 2-tape Turing machines by 1-tape Turing machines an optimal quadratic lower bound in the deterministic case and a nearly optimal lower bound in the nonde...
متن کامل